Multivariate Polynomials: A Spanning Question
نویسنده
چکیده
There are many different methods of approximating multivariate functions. We have, for example, the classic methods of polynomials, Fourier series, or tensor products, and more modern methods using wavelets, radial basis functions, multivariate splines, or ridge functions. Many of these are natural generalizations of methods developed for approximating univariate functions. However, functions of many variables are fundamentally different from functions of one variable, and approximation techniques for such problems are much less developed and understood. We discuss in these pages one approach to this problem which is truly multivariate in character. To motivate the approach considered, we recall Hilbert 's 13th problem. Although not formulated in the following terms, Hilbert 's 13th problem was interpreted by some as conjecturing that not all functions of three variables could be represented as superposi t ions (compositions) and sums of functions of two variables. Surprisingly it transpired that all functions could be so represented, and even more was true. Kolmogorov and his student Arnold proved in a series of papers in the late 1950s that fixed continuous one-variable functions hii exist such that every continuous function f of d variables on [0, 1] d could be represented in the form
منابع مشابه
Weighted enumeration of spanning subgraphs with degree constraints
The Heilmann-Lieb Theorem on (univariate) matching polynomials states that the polynomial ∑ k mk(G)y k has only real nonpositive zeros, in which mk(G) is the number of k-edge matchings of a graph G. There is a stronger multivariate version of this theorem. We provide a general method by which “theorems of Heilmann-Lieb type” can be proved for a wide variety of polynomials attached to the graph ...
متن کاملLecture 10 & 11 : Real Stable and Hyperbolic Polynomials
In this lecture we introduce hyperbolic and real stable polynomials as natural generalization of real-rootedness to multivariate polynomials. Then, we define strongly Rayleigh distributions as probability distribution whose generating function is a real stable polynomial. We will see that this is a generalization of random spanning tree distributions and determinantal distributions. We will fin...
متن کاملThe Complexity of Testing Monomials in Multivariate Polynomials
The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economically compact structure has a multilinear monomial in its sum-product expansion. The complexity aspects of this problem and its variants are investigated with two folds of objectives. One is to understand how this prob...
متن کاملPublic-Key Identification Schemes Based on Multivariate Cubic Polynomials
Solving a system of multivariate polynomials over a finite field is a promising problem in cryptography. Recently, Sakumoto et al. proposed public-key identification schemes based on the quadratic version of the problem, which is called the MQ problem. However, it is still an open question whether or not it is able to build efficient constructions of public-key identification based on multivari...
متن کاملLecture 1 : Introduction , the Matching Polynomial
The Geometry of Polynomials, also known as the analytic theory of polynomials, refers the study of the zero loci of polynomials with complex coefficients (and their dynamics under various transformations of the polynomials) using methods of real and complex analysis. The course will focus on the fragment of this subject which deals with real-rooted polynomials and their multivariate generalizat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004